Acute Triangulations of Archimedean Surfaces . The Truncated Tetrahedron
نویسندگان
چکیده
In this paper we prove that the surface of the regular truncated tetrahedron can be triangulated into 10 non-obtuse geodesic triangles, and also into 12 acute geodesic triangles. Furthermore, we show that both triangulations have minimal size.
منابع مشابه
Decoration of the Truncated Tetrahedron - An Archimedean Polyhedron - To Produce a New Class of Convex Equilateral Polyhedra with Tetrahedral Symmetry
The Goldberg construction of symmetric cages involves pasting a patch cut out of a regular tiling onto the faces of a Platonic host polyhedron, resulting in a cage with the same symmetry as the host. For example, cutting equilateral triangular patches from a 6.6.6 tiling of hexagons and pasting them onto the full triangular faces of an icosahedron produces icosahedral fullerene cages. Here we s...
متن کاملEdge Unfoldings of Platonic Solids Never Overlap
Is every edge unfolding of every Platonic solid overlapfree? The answer is yes. In other words, if we develop a Platonic solid by cutting along its edges, we always obtain a flat nonoverlapping simple polygon. We also give self-overlapping general unfoldings of Platonic solids other than the tetrahedron (i.e., a cube, an octahedron, a dodecahedron, and an icosahedron), and edge unfoldings of so...
متن کاملAcute Triangulations of Polyhedra and R
We study the problem of acute triangulations of convex polyhedra and the space R. Here an acute triangulation is a triangulation into simplices whose dihedral angles are acute. We prove that acute triangulations of the n-cube do not exist for n≥4. Further, we prove that acute triangulations of the space R do not exist for n≥5. In the opposite direction, in R, we present a construction of an acu...
متن کاملAcute triangulations of polyhedra and ℝ N
We study the problem of acute triangulations of convex polyhedra and the space Rn. Here an acute triangulation is a triangulation into simplices whose dihedral angles are acute. We prove that acute triangulations of the n–cube do not exist for n ≥ 4. Further, we prove that acute triangulations of the space Rn do not exist for n ≥ 5. In the opposite direction, in R3, we present a construction of...
متن کاملConstruction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations
Three-dimensional Delaunay triangulations are the most common form of three-dimensional triangulations known, but they are not very suitable for tetrahedral nite element meshes because they tend to contain poorly-shaped sliver tetrahedra. In this paper, we present an algorithm for constructing improved-quality triangulations with respect to a tetrahedron shape measure. This algorithm uses combi...
متن کامل